The Borel–Cantelli Lemmas, Probability Laws and Kolmogorov Complexity
نویسندگان
چکیده
منابع مشابه
Conditional Kolmogorov complexity and universal probability
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. The least upper semicomputable code-length is up to a constant equal to the negative logarithm of the greatest lower semicomputable probability mass function. We investi...
متن کاملExtracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
We apply results on extracting randomness from independent sources to “extract” Kolmogorov complexity. For any α, > 0, given a string x with K(x) > α|x|, we show how to use a constant number of advice bits to efficiently compute another string y, |y| = Ω(|x|), with K(y) > (1− )|y|. This result holds for both unbounded and space-bounded Kolmogorov complexity. We use the extraction procedure for ...
متن کاملDifferences between Kolmogorov Complexity and Solomonoff Probability: Consequences for AGI
Kolmogorov complexity and algorithmic probability are compared in the context of the universal algorithmic intelligence. Accuracy of time series prediction based on single best model and on averaging over multiple models is estimated. Connection between inductive behavior and multi-model prediction is established. Uncertainty as a heuristic for reducing the number of used models without losses ...
متن کاملCompressibility and Kolmogorov Complexity
We continue the investigation of the path-connected geometry on the Cantor space and the related notions of dilution and compressibility described in [1]. These ideas are closely related to the notions of effective Hausdorff and packing dimensions of reals, and we argue that this geometry provides the natural context in which to study them. In particular we show that every regular real can be m...
متن کاملKolmogorov complexity and cryptography
We consider (in the framework of algorithmic information theory) questions of the following type: construct a message that contains different amounts of information for recipients that have (or do not have) certain a priori information. Assume, for example, that the recipient knows some string a, and we want to send her some information that allows her to reconstruct some string b (using a). On...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2001
ISSN: 0091-1798
DOI: 10.1214/aop/1015345756